Towards an Effective Task Clustering Heuristic for LogP Machines
نویسندگان
چکیده
This paper describes a task scheduling algorithm, based on a LogP -type model, for allocating arbitrary task graphs to fully connected networks of processors. This problem is known to be NP-complete even under the delay model (a special case under the LogP model). The strategy exploits the replication and clustering of tasks to minimise the ill e ects of communication overhead on the makespan. The quality of the schedules produced by this LogP -based algorithm, initially under delay model conditions, is compared with that of other good delay model-based approaches.
منابع مشابه
Towards Optimal Static Task Scheduling for Realistic Machine Models: Theory and Practice
Task scheduling is a key element in achieving high performance from multicomputer systems. Efficient scheduling algorithms reduce the interprocessor communication and improve processor utilization. To do so effectively, such algorithms must be based on a communication cost model appropriate for computing systems in use. The optimal scheduling of tasks is NP-hard, and a large number of heuristic...
متن کاملVizzScheduler - A Framework for the Visualization of Scheduling Algorithms
The computation of efficient schedules of task graphs for parallel machines is a major issue in parallel computing. Such algorithms are often hard to understand and hard to evaluate. We present a framework for the visualization of scheduling algorithms. Using the LogP cost model for parallel machines, we simulate the effects of scheduling algorithms for specific target machines and task graphs ...
متن کاملList scheduling of general task graphs under LogP
List scheduling is the most frequently used scheduling technique. In this context worst case analysis as well as many experimental studies were performed for various computational models. However, many new models have been proposed during the last decade with the aim to provide a realistic but still simple and general model of parallel computation. LogP is one of the most popular models so far ...
متن کاملScheduling balanced task-graphs to LogP-machines
This article discusses algorithms for scheduling task graphs G V E to LogP machines These algorithms depend on the granularity of G i e on the ratio of computation v and communication times in the LogP cost model and on the structure of G We de ne a class of coarse grained task graphs that can be scheduled with a performance guarantee of Topt G where Topt G is the time required for the optimal ...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کامل